WORST_CASE(?,O(n^1))

Solution:
---------

  "c" :: ["A"(0) x "A"(7)] -(7)-> "A"(7)
  "c" :: ["A"(0) x "A"(14)] -(14)-> "A"(14)
  "f" :: ["A"(7)] -(0)-> "A"(14)
  "g" :: ["A"(14)] -(11)-> "A"(3)
  "s" :: ["A"(7)] -(7)-> "A"(7)
  "s" :: ["A"(0)] -(0)-> "A"(0)


Cost Free Signatures:
---------------------

  "c" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "f" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "s" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"c\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"s\"_A" :: ["A"(1)] -(1)-> "A"(1)